pointer jumping in a sentence

• The following image provides an example of using pointer jumping on a small forest.
• One of the simpler tasks that can be solved by a pointer jumping algorithm is the " list ranking " problem.
• The pointer jumping occurs in the last line of the algorithm, where each node's pointer is reset to skip the node's direct successor.
• This problem can easily be solved in linear time on a sequential machine, but a parallel algorithm can do better : given processors, the problem can be solved in logarithmic time,, by the following pointer jumping algorithm:
• Since the pointer jumping in each iteration splits the list into two parts, one consisting of the " odd " elements and one of the " even " elements, the length of the list pointed to by each processor's is halved in each iteration, which can be done at most time before each list has a length of at most one.
• It's difficult to see pointer jumping in a sentence .